Cellular Communications Systems in Congested Environments by Mo Ghorbanzadeh Ahmed Abdelhadi & Charles Clancy

Author:Mo Ghorbanzadeh, Ahmed Abdelhadi & Charles Clancy
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

Then, the distributed resource allocation architecture’s IURA algorithm has the UEs which internally allocate rates to their applications based on the pledged bids as illustrated in Figs. 4.7 and 4.8. In Fig. 4.7, we show the allocated applications rates during the IURA algorithm under changing eNB rate R. As we can observe, initially more resources are allocated to the real-time applications since these have more stringent QoS requirements. In Fig. 4.8, we illustrate the applications’ internally pledged bids during the IURA algorithm under changing eNB rate R. Inasmuch as the real-time applications of the UEs need more resources, they bid higher than the delay-tolerant applications specially when the resources are scarce. In fact, we can see that the bid values for the delay-tolerant applications is significantly less than those of the real-time ones such that they are very close to the horizontal axis in Fig. 4.8. Furthermore, those applications with higher QoS requirements such as the real-time streaming video in UE1 (red plot) bid higher in order to gain more bandwidth. However, as more resources become available at the eNB, bid values slash down as well.

Fig. 4.7 Application Optimal Rates This figure depicts the optimal application rates versus the eNB rate R. Applications running on an UE are identically colored. As we can see, real-time applications are initially allocated more resources as opposed to the delay-tolerant ones due to their urgent need for resources

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.